Implementation of Intention-driven Search Processes by SPARQL Queries

نویسندگان

  • Olivier Corby
  • Catherine Faron-Zucker
  • Isabelle Mirbel
چکیده

Capitalisation of search processes becomes a real challenge in many domains. By search process, we mean a sequence of queries that enables a community member to find comprehensive and accurate information by composing results from different information sources. In this paper we propose a intentional model based on semantic Web technologies and models and aiming both at the capitalization, reuse and sharing of queries into a community and at the organization of queries into formalized search processes. It is intended to support knowledge transfer on information searches between expert and novice members inside a community. Intention-driven search processes are represented by RDF datasets and operationalized by rules represented by SPARQL queries and applied in backward chaining by using the CORESE semantic engine.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بررسی میزان همخوانی عبارت‌های جستجوی کاربران با اصطلاحات پیشنهادی مقالات در پیشینه‌های کتابشناختی پایگاه‌های اطلاعاتی لاتین EBSCO و IEEE

Purpose: This study aims to investigate correspondence of users' queries with alternative terms of Latin databases namely IEEE and EBSCO. Databases display subjective content of their documents through natural or controlled language vocabularies in specified bibliographic fields along with other bibliographic information that are called papers alternative terms. Methodology: We used content an...

متن کامل

An Online Learning-based Efficient Search System for Sufficient SPARQL Endpoints Using Extended Multi-armed Bandit Algorithm

On searching and integrating various kinds of open data, one of crucial issues is to efficiently find sufficient SPARQL endpoints that store sufficient data to be retrieved in the query. In this demonstration, we will present our online learning-based efficient search algorithm and our prototype implementation based on an extended multi-armed bandit approach, which takes into account how the de...

متن کامل

SPARQL-DL Implementation Experience

Recently, SPARQL-DL was introduced in [7] as a rich query language for OWL-DL ontologies. It provides an OWL-DL-like semantics for SPARQL basic graph patterns which involves as special cases both conjunctive ABox queries and mixed TBox/RBox/ABox queries over Description Logic (DL) ontologies. This paper describes the implementation of a SPARQL-DL query engine and discusses several optimizations...

متن کامل

An Evaluation of SPARQL Federation Engines Over Multiple Endpoints

Due to decentralized and linked architecture underlying Linking Data, running complex queries often require collecting data from multiple RDF datasets. The optimization of the runtime of such queries, called federated queries, is of central importance to ensure the scalability of Semantic-Web and Linked-Data-driven applications. This has motivated a considerable body of work on SPARQL query fed...

متن کامل

Sapphire: Querying RDF Data Made Simple

There is currently a large amount of publicly accessible structured data available as RDF data sets. For example, the Linked Open Data (LOD) cloud now consists of thousands of RDF data sets with over 30 billion triples, and the number and size of the data sets is continuously growing. Many of the data sets in the LOD cloud provide public SPARQL endpoints to allow issuing queries over them. Thes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009